T-functions revisited: new criteria for bijectivity/transitivity
نویسندگان
چکیده
منابع مشابه
T-functions revisited: new criteria for bijectivity/transitivity
The paper presents new criteria for bijectivity/transitivity of Tfunctions and fast knapsack-like algorithm of evaluation of a T-function. Our approach is based on non-Archimedean ergodic theory: Both the criteria and algorithm use van der Put series to represent 1-Lipschitz p-adic functions and to study measure-preservation/ergodicity of these.
متن کاملA new Design Criteria for Hash-Functions
The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The compression function is usually designed from scratch or made out of a block-cipher. In this paper, we introduce a new security notion for hash-functions, stronger than collision-resistance. Under this notion, the arbitrary length hash function H must behave as a rand...
متن کاملA NEW CYTOCOLORIMETRIC ASSAY USING PHOSPHATAS E ACTIVI T Y FOR MEASURING CELLULAR FUNCTIONS
In this study cellular phosphatase activity, referred to as enzyme developed color (EDC) assay, was used for an in vitro assessment of cell proliferation and cytotoxicity. Optimum conditions were established and found to be 10 x103 cells / well at 37°C and 60 min incubation (for developing color). Under the same conditions a direct correlation between optical density (00) and cell number wa...
متن کاملNew integral inequalities for $s$-preinvex functions
In this note, we give some estimate of the generalized quadrature formula of Gauss-Jacobi$$underset{a}{overset{a+eta left( b,aright) }{int }}left( x-aright)^{p}left( a+eta left( b,aright) -xright) ^{q}fleft( xright) dx$$in the cases where $f$ and $left| fright| ^{lambda }$ for $lambda >1$, are $s$-preinvex functions in the second sense.
متن کاملNew Design Criteria for Hash Functions and Block Ciphers
Cryptographic primitives, such as hash functions and block ciphers, are integral components in several practical cryptographic schemes. In order to prove security of these schemes, a variety of security assumptions are made on the underlying hash function or block cipher, such as collision-resistance, pseudorandomness etc. In fact, such assumptions are often made without much regard for the act...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2012
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-012-9741-z